Cobham-Semenov theorem and Nd-subshifts
نویسنده
چکیده
We give a new proof of the Cobham’s first theorem using ideas from symbolic dynamics and of the Cobham-Semenov theorem (in the primitive case) using ideas from tiling dynamics.
منابع مشابه
LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
We survey the properties of sets of integers recognizable by automata when they are written in p-ary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to Nm due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of Cobham-Semenov, the original proof being published in Russian.
متن کاملA theorem of Cobham for non-primitive substitutions
Given a subset E of N = {0, 1, 2, · · · } can we find an elementary algorithm (i.e., a finite state automaton) which accepts the elements of E and rejects those that do not belong to E? In 1969 A. Cobham showed that the existence of such an algorithm deeply depends on the numeration base. He stated [Co1]: Let p and q be two multiplicatively independent integers (i.e., p 6= q for all integers k,...
متن کاملSubshifts and Logic: Back and Forth
We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of “pattern counting” subshifts. Conversely, we characterise logic fragments corresponding to various clas...
متن کاملGibbs and Equilibrium Measures for Some Families of Subshifts
For SFTs, any equilibrium measure is Gibbs, as long a f has dsummable variation. This is a theorem of Lanford and Ruelle. Conversely, a theorem of Dobrušin states that for strongly-irreducible subshifts, shiftinvariant Gibbs-measures are equilibrium measures. Here we prove a generalization of the Lanford-Ruelle theorem: for all subshifts, any equilibrium measure for a function with d-summable v...
متن کاملOn Cobham’s theorem
Let k > 2 be an integer. A set X of integers is k-recognizable if the language of k-aryrepresentations of the elements in X is accepted by a finite automaton. The celebrated theorem ofCobham from 1969 states that if a set of integers is both k-recognizable and l-recognizable, thenit is a finite union of arithmetic progressions. We present several extensions of this result to non-<lb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 391 شماره
صفحات -
تاریخ انتشار 2008